Minimum Neighborhood Domination of Split Graph of Graphs

Let be a non-trivial simple graph. A dominating set in graph is of vertices such that every vertex not the adjacent to at least one set. subset minimum neighborhood if and for holds. The cardinality called as number it denoted by . where intersection neighborhoods all small possible, (i.e., ). number, , In other words, smallest needed form neighborhood-dominating concept related study structure properties graphs used various fields computer science, operations research, network design. also useful theory has applications areas design control theory. This variation traditional problem adds an extra constraint on It NP-hard problem. main aim this paper domination split some graphs.